Matching Similar Splits between Unrooted Leaf-labeled Trees
نویسندگان
چکیده
منابع مشابه
Matching Similar Splits between Unrooted Leaf-labeled Trees
Tree comparison is ubiquitous in many areas. The simplest way for tree comparison is to define a pairwise distance measure. In a more refined comparison, one can establish a mapping between similar parts in two trees according to certain similarity measure. The best match problem for rooted leaf-labeled trees has been studied in the literature. However, no result has been found for the best mat...
متن کاملAnomalous unrooted gene trees.
The coalescent and multispecies coalescent model rooted genealogies backward through time. Often, the direction of time is unknown in trees estimated from molecular sequences due to reversible mutation models, absence of an appropriate outgroup, and the absence of the molecular clock. In this article, probabilities of unrooted gene-tree topologies under the multispecies coalescent are considere...
متن کاملOn Graph Powers for Leaf-Labeled Trees
We extend the well-studied concept of a graph power to that of a k-leaf power G of a tree T : G is formed by creating a node for each leaf in the tree and an edge between a pair of nodes if and only if the associated leaves are connected by a path of length at most k. By discovering hidden combinatorial structure of cliques and neighborhoods, we have developed polynomial-time algorithms that, f...
متن کاملComputing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node’s incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. We give an O(n logn) algorithm to compute the e...
متن کاملOn the Balance of Unrooted Trees
We solve a class of optimization problems for (phylogenetic) X-trees or their shapes. These problems have recently appeared in different contexts, e.g. in the context of the impact of tree shapes on the size of TBR neighborhoods, but so far these problems have not been characterized and solved in a systematic way. In this work we generalize the concept and also present several applications. Mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2015
ISSN: 1874-110X
DOI: 10.2174/1874110x01509010110